SLAB Benchmarks
نویسندگان
چکیده
Abstraction and slicing are both techniques for reducing the size of the state space to be inspected during verification. In the paper [1], we present a new model checking procedure for infinite-state concurrent systems that interleaves automatic abstraction refinement, which splits states according to new predicates obtained by Craig interpolation, with slicing, which removes irrelevant states and transitions from the abstraction. The effects of abstraction and slicing complement each other. As the refinement progresses, the increasing accuracy of the abstract model allows for a more precise slice; the resulting smaller representation gives room for additional predicates in the abstraction. The procedure terminates when an error path in the abstraction can be concretized, which proves that the system is erroneous, or when the slice becomes empty, which proves that the system is correct.
منابع مشابه
Magazines and Vmem: Extending the Slab Allocator to Many CPUs and Arbitrary Resources
The slab allocator [Bonwick94] provides efficient object caching but has two significant limitations: its global locking doesn’t scale to many CPUs, and the allocator can’t manage resources other than kernel memory. To provide scalability we introduce a per−processor caching scheme called the magazine layer that provides linear scaling to any number of CPUs. To support more general resource all...
متن کاملBounding Volume Hierarchies of Slab Cut Balls
We introduce a bounding volume hierarchy based on the Slab Cut Ball. This novel type of enclosing volume provides an attractive balance between tightness of fit, cost of overlap testing, and memory requirement. The hierarchy construction algorithm includes a new method for the construction of tight bounding volumes in worst case O(n) time, which means our tree data structure is constructed in O...
متن کاملA truncated EM approach for spike-and-slab sparse coding
We study inference and learning based on a sparse coding model with ‘spike-and-slab’ prior. As in standard sparse coding, the model used assumes independent latent sources that linearly combine to generate data points. However, instead of using a standard sparse prior such as a Laplace distribution, we study the application of a more flexible ‘spike-and-slab’ distribution which models the absen...
متن کاملA Truncated Variational EM Approach for Spike-and-Slab Sparse Coding
We study inference and learning based on a sparse coding model with ‘spike-and-slab’ prior. As standard sparse coding, the used model assumes independent latent sources that linearly combine to generate data points. However, instead of using a standard sparse prior such as a Laplace distribution, we study the application of a more flexible ‘spike-and-slab’ distribution which models the absence ...
متن کاملFully Self-Consistent Hartree-Fock Calculation of Jellium Slabs: Exact Treatment of Exchange Operator
We present Hartree-Fock surface energies, work functions and dipole barriers for a Jellium slab model at different electron densities and slab widths. The fully self-consistent calculations take into account the nonlocal exchange coupling of the momentum parallel to the surface with the perpendicular component of the orbitals. Typical oszillations due to quantum size effects have been observed....
متن کاملSelect-and-Sample for Spike-and-Slab Sparse Coding
Probabilistic inference serves as a popular model for neural processing. It is still unclear, however, how approximate probabilistic inference can be accurate and scalable to very high-dimensional continuous latent spaces. Especially as typical posteriors for sensory data can be expected to exhibit complex latent dependencies including multiple modes. Here, we study an approach that can efficie...
متن کامل